Hexagonal Convolutional Neural Networks for Hexagonal Grids
نویسندگان
چکیده
منابع مشابه
Hexagonal Grids for Choice Experiments
In this note we construct designs on the hexagonal grid to be used for choice experiments.
متن کاملFirefighting on square, hexagonal, and triangular grids
In this paper, we consider the firefighter problem on a graph G = (V,E) that is either finite or infinite. Suppose that a fire breaks out at a given vertex v ∈ V . In each subsequent time unit, a firefighter protects one vertex which is not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as...
متن کاملHigher dimensional hexagonal networks
We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k þ 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, whic...
متن کاملSpot addressing for microarray images structured in hexagonal grids
In this work, an efficient method for spot addressing in images, which are generated by the scanning of hexagonal structured microarrays, is proposed. Initially, the blocks of the image are separated using the projections of the image. Next, all the blocks of the image are processed separately for the detection of each spot. The spot addressing procedure begins with the detection of the high in...
متن کاملNeighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
The two-dimensional hexagonal grid and the three-dimensional face-centered cubic grid can be described by intersecting Z and Z with a (hyper)plane. Corresponding grids in higher dimensions (nD) are examined. In this paper, we define distance functions based on neighborhood sequences on these, higher dimensional generalizations of the hexagonal grid. An algorithm to produce a shortest path based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2944766